Iteration Functions in Some Nonsmooth Optimization Algorithms
نویسندگان
چکیده
منابع مشابه
Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis
Nonconvex optimization problems are frequently encountered in much of statistics, business, science and engineering, but they are not yet widely recognized as a technology. A reason for this relatively low degree of popularity is the lack of a well developed system of theory and algorithms to support the applications, as is the case for its convex counterpart. This paper aims to take one step i...
متن کاملNonsmooth Optimization Algorithms in Some Problems of Fracture Dynamics
Mathematical statement of elastodynamic contact problem for cracked body with considering unilateral restrictions and friction of the crack faces is done in classical and weak forms. Different variational formulations of unilateral contact problems with friction based on boundary variational principle are considered. Nonsmooth optimization algorithms of Udzawa’s type for solution of unilateral ...
متن کاملLocal structure and algorithms in nonsmooth optimization
Given a real δ, find stable real polynomials p and q such that the polynomial r(s) = (s − 2δs+ 1)p(s) + (s − 1)q(s) is also stable. (We call a polynomial p stable if its abscissa α(p) = max{Re s : p(s) = 0} is nonpositive.) Clearly the problem is unsolvable if δ = 1, since then r(1) = 0; more delicate results (summarized in [7]) show it remains unsolvable for δ < 1 close to 1. Blondel offered a...
متن کاملOn Some Iteration Properties of Boolean Functions
This paper introduces and describes an iterative model for the study of some properties of Boolean functions. Several kinds of iterative functions are studied: they are obtained by substituting some of the independent variables x, off (x) by the function f itself. Algebraic formulas relating classical representation modes of Boolean functions to the iterative forms are introduced. Several possi...
متن کاملFrom geometric optimization and nonsmooth analysis to distributed coordination algorithms
We investigate the coordination of groups of autonomous robots performing spatially-distributed sensing tasks. We present facility location functions from geometric optimization and study their differentiable properties. We then design distributed coordination algorithms and analyze them as nonsmooth gradient flows. The resulting control laws correspond to basic interaction behaviors between th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1997
ISSN: 0022-247X
DOI: 10.1006/jmaa.1997.5450